Mathematical Morphology on Hypergraphs Using Vertex-Hyperedge Correspondence
نویسندگان
چکیده
منابع مشابه
Similarity between Hypergraphs Based on Mathematical Morphology
In the framework of structural representations for applications in image understanding, we establish links between similarities, hypergraph theory and mathematical morphology. We propose new similarity measures and pseudo-metrics on lattices of hypergraphs based on morphological operators. New forms of these operators on hypergraphs are introduced as well. Some examples based on various dilatio...
متن کاملMathematical morphology on hypergraphs, application to similarity and positive kernel
The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can...
متن کاملMathematical Morphology on Hypergraphs: Preliminary Definitions and Results
In this article we introduce mathematical morphology on hypergraphs. We first define lattice structures and then mathematical morphology operators on hypergraphs. We show some relations between these operators and the hypergraph structure, considering in particular duality and similarity aspects.
متن کاملMorphological filtering on hypergraphs
The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyper edge set of a hypergraph H , by defining a vertex-hyperedge correspondence. This allows us to recover the...
متن کاملOn Multivariate Chromatic Polynomials of Hypergraphs and Hyperedge Elimination
In this paper we introduce multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously investigated for graphs by Averbouch, Godlin, and Makowsky. The multivariate chromatic polynomial is an equivalent polynomial defined in terms of colorings, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Discrete Mathematics
سال: 2014
ISSN: 2090-7788
DOI: 10.1155/2014/436419